Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
11	How to apply de Bruijn graphs to genome assembly Add to Reading List Source URL: www.nature.com Language: English - Date: 2012-01-20 11:24:28 Graph theory Mathematics Bioinformatics NP-complete problems Computational biology DNA sequencing K-mer Velvet assembler Eulerian path Hamiltonian path Degree Seven Bridges of Knigsberg
12	Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-12-26 02:45:42 Graph theory NP-complete problems Graph operations Line graph Cograph Clique Neighbourhood Matching Hypergraph Independent set Graph Dominating set
13	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-01-06 11:50:35 Graph theory Bipartite graphs Graph operations NP-complete problems Chordal bipartite graph Chordal graph Distance-hereditary graph Matching Line graph Split graph Graph Cycle
14	Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2015-09-15 10:40:14 Graph theory Topological graph theory Graph Topological graph Planar graph Petersen graph
15	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring
16	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
17	Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2005-06-30 12:02:42 Graph theory Mathematics Algebra Algebraic graph theory Matrices NP-complete problems Eigenvalues and eigenvectors Linear algebra Regular graph Planar graph Laplacian matrix Adjacency matrix
18	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-04-20 05:14:26 Cryptography Graph theory Mathematics NP-complete problems Zero-knowledge proof Algebraic graph theory Commitment scheme Hamiltonian path problem Hamiltonian path Proof of knowledge Adjacency matrix NP
19	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
20	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding